On Covering a Solid Sphere with Concentric Spheres in ${\mathbb Z}^3$
نویسندگان
چکیده
We show that a digital sphere, constructed by the circular sweep of a digital semicircle (generatrix) around its diameter, consists of some holes (absentee-voxels), which appear on its spherical surface of revolution. This incompleteness calls for a proper characterization of the absentee-voxels whose restoration will yield a complete spherical surface without any holes. In this paper, we present a characterization of such absentee-voxels using certain techniques of digital geometry and show that their count varies quadratically with the radius of the semicircular generatrix. Next, we design an algorithm to fill these absentee-voxels so as to generate a spherical surface of revolution, which is more realistic from the viewpoint of visual perception. We further show that covering a solid sphere by a set of complete spheres also results in an asymptotically larger count of absentees, which is cubic in the radius of the sphere. The characterization and generation of complete solid spheres without any holes can also be accomplished in a similar fashion. We furnish test results to substantiate our theoretical findings.
منابع مشابه
A new family in the stable homotopy groups of spheres
Let $p$ be a prime number greater than three. In this paper, we prove the existence of a new family of homotopy elements in the stable homotopy groups of spheres $pi_{ast}(S)$ which is represented by $h_nh_mtilde{beta}_{s+2}in {rm Ext}_A^{s+4, q[p^n+p^m+(s+2)p+(s+1)]+s}(mathbb{Z}_p,mathbb{Z}_p)$ up to nonzero scalar in the Adams spectral sequence, where $ngeq m+2>5$, $0leq sExt}_A^{s+2,q[(s+2)p...
متن کاملMEAN VALUE INTERPOLATION ON SPHERES
In this paper we consider multivariate Lagrange mean-value interpolation problem, where interpolation parameters are integrals over spheres. We have concentric spheres. Indeed, we consider the problem in three variables when it is not correct.
متن کاملOn Codes over $\mathbb{Z}_{p^2}$ and its Covering Radius
This paper gives lower and upper bounds on the covering radius of codes over $\mathbb{Z}_{p^2}$ with respect to Lee distance. We also determine the covering radius of various Repetition codes over $\mathbb{Z}_{p^2}.$
متن کاملDetection of a nontrivial element in the stable homotopy groups of spheres
Let $p$ be a prime with $pgeq 7$ and $q=2(p-1)$. In this paper we prove the existence of a nontrivial product of filtration $s+4$ in the stable homotopy groups of spheres. This nontrivial product is shown to be represented up to a nonzero scalar by the product element $widetilde{gamma}_{s}b_{n-1}g_{0}in {Ext}_{mathcal{A}}^{s+4,(p^n+sp^2+sp+s)q+s-3}(mathbb{Z}/p,mathbb{Z}/p)$ in ...
متن کاملOn Some Classes of $\mathbb{Z}_{2}\mathbb{Z}_{4}-$Linear Codes and their Covering Radius
In this paper we define Z2Z4−Simplex and MacDonald Codes of type α and β and we give the covering radius of these codes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1411.1395 شماره
صفحات -
تاریخ انتشار 2014